Large minors in graphs with given independence number
نویسندگان
چکیده
منابع مشابه
Large minors in graphs with given independence number
Aweakening of Hadwiger’s conjecture states that every n-vertex graphwith independence number α has a clique minor of size at least n α . Extending ideas of Fox (2010) [6], we prove that such a graph has a clique minor with at least n (2−c)α vertices where c > 1/19.2. © 2011 Elsevier B.V. All rights reserved.
متن کاملLarge Minors in Graphs with a given Stability Number
A weakening of Hadwiger’s Conjecture states that every n-vertex graph with independence number α has a clique minor of size at least n α . Extending ideas of Fox [6], we prove that such a graph has a clique minor with at least n (2−c)α vertices where c > 1/19.2.
متن کاملDisjoint Kr-minors in large graphs with given average degree
It is proved that there are functions f (r) and N(r, s) such that for every positive integer r , s, each graph G with average degree d(G) = 2|E(G)|/|V (G)| ≥ f (r), and with at least N(r, s) vertices has a minor isomorphic to Kr,s or to the union of s disjoint copies of Kr . © 2005 Published by Elsevier Ltd
متن کاملLongest cycles in k-connected graphs with given independence number
The Chvátal–Erdős Theorem states that every graph whose connectivity is at least its independence number has a spanning cycle. In 1976, Fouquet and Jolivet conjectured an extension: If G is an n-vertex k-connected graph with independence number a, and a ≥ k, then G has a cycle with length at least k(n+a−k) a . We prove this conjecture.
متن کاملHighly connected subgraphs of graphs with given independence number
Let G be a graph on n vertices with independence number α. What is the largest k-connected subgraph that G must contain? We prove that if n is sufficiently large (n ≥ αk + 1 will do), then G always contains a k-connected subgraph on at least n/α vertices. This is sharp, since G might be the disjoint union of α equally-sized cliques. For k ≥ 3 and α = 2, 3, we shall prove that the same result ho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2011
ISSN: 0012-365X
DOI: 10.1016/j.disc.2011.07.003